A simple proof of orientability in colored group field theory
نویسنده
چکیده
BACKGROUND Group field theory is an emerging field at the boundary between Quantum Gravity, Statistical Mechanics and Quantum Field Theory and provides a path integral for the gluing of n-simplices. Colored group field theory has been introduced in order to improve the renormalizability of the theory and associates colors to the faces of the simplices. The theory of crystallizations is instead a field at the boundary between graph theory and combinatorial topology and deals with n-simplices as colored graphs. Several techniques have been introduced in order to study the topology of the pseudo-manifold associated to the colored graph. Although of the similarity between colored group field theory and the theory of crystallizations, the connection between the two fields has never been made explicit. FINDINGS In this short note we use results from the theory of crystallizations to prove that color in group field theories guarantees orientability of the piecewise linear pseudo-manifolds associated to each graph generated perturbatively. CONCLUSIONS Colored group field theories generate orientable pseudo-manifolds. The origin of orientability is the presence of two interaction vertices in the action of colored group field theories. In order to obtain the result, we made the connection between the theory of crystallizations and colored group field theory.
منابع مشابه
A simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملA short proof of the maximum conjecture in CR dimension one
In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...
متن کاملColored Prüfer Codes for k-Edge Colored Trees
A combinatorial bijection between k-edge colored trees and colored Prüfer codes for labelled trees is established. This bijection gives a simple combinatorial proof for the number k(n − 2)!(nk−n n−2 ) of k-edge colored trees with n vertices.
متن کاملTitle of dissertation: BEYOND ORIENTABILITY AND COMPACTNESS: NEW RESULTS ON THE DYNAMICS OF FLAT SURFACES
Title of dissertation: BEYOND ORIENTABILITY AND COMPACTNESS: NEW RESULTS ON THE DYNAMICS OF FLAT SURFACES Rodrigo Treviño, Doctor of Philosophy, 2012 Dissertation directed by: Professor Giovanni Forni Department of Mathematics In the first part, we prove the non-uniform hyperbolicity of the KontsevichZorich cocycle for a measure supported on abelian differentials which come from nonorientable q...
متن کاملMagnetic Properties and Phase Transitions in a Spin-1 Random Transverse Ising Model on Simple Cubic Lattice
Within the effective-field theory with correlations (EFT), a transverse random field spin-1 Ising model on the simple cubic (z=6) lattice is studied. The phase diagrams, the behavior of critical points, transverse magnetization, internal energy, magnetic specific heat are obtained numerically and discussed for different values of p the concentration of the random transverse field.
متن کامل